T-Theorem Proving I
نویسندگان
چکیده
منابع مشابه
ASSIP-T: A Theorem-Proving Machine
An associative processor for theorem proving in first order logic is described. It. is designed on the basis of the deduction plan method, introduced by Cox and Pietrzykowski. The main features of this method are the separation of unification from deduction and the incorporation of a method for intelligent backtracking-This kind of backtracking is based on a special unification procedure. An im...
متن کاملTheorem Proving with Constrained
Deduction methods for rst-order constrained clauses with equality are described within an abstract framework: constraint strategies, consisting of an inference system, a constraint inheritance strategy and redundancy criteria for clauses and inferences. We give simple conditions for such a constraint strategy to be complete (refutationally and in the sense of Knuth-Bendix-like completion). This...
متن کاملModal Theorem Proving
We describe resolution proof systems for several modal logics. First we present the propo-sitional versions of the systems and prove their completeness. The first-order resolution rule for classical logic is then modified to handle quantifiers directly. This new resolution rule enables us to extend our propositional systems to complete first-order systems. The systems for the different modal lo...
متن کاملTheorem Proving modulo Associativity
We present an inference system for rst-order constrained clauses with equality modulo associativity (A). Our procedure is refutationally complete and reduces to Knuth-Bendix completion modulo A in the equational case. As an essential ingredient we present the rst |as far as we know| A-compatible reduction ordering total on the ground A-congruence classes.
متن کاملAbstract Theorem Proving
Informally, a b s t r a c t i o n can be described as the process of mapping a representation of a problem into a new representation. The aim of the paper is to propose a theory of abstrac t ion. The generality of the framework is tested by formalizing and analyzing some work done in the past; i ts efficacy by giving a procedure which solves the '' false proof problem by avoid ing the use of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1995
ISSN: 0747-7171
DOI: 10.1006/jsco.1995.1053